Fast Multiresolution Mesh Decompression
نویسندگان
چکیده
Compression techniques for triangle-mesh representations of 3D models have been the focus of many recent efforts from the graphics, modeling, and theory research community; from developers of computer graphics hardware and software; and from organizations that define international standards. An ideal compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (2) nearly optimal compression ratios for both geometry and connectivity, and (3) in-line, real-time decompression algorithms for hardware or software implementations. Because these three objectives impose contradictory constraints on the compressed format, previously reported efforts focus primarily on one – sometimes two – of these objectives. The SQUEEZE technique introduced here for Fast and Progressive Decompression of Triangle Meshes addresses all three constraints simultaneously and attempts to provide the best possible compromise for the needs of common internet applications that require frequent access to remote 3D databases. For a typical mesh of T triangles, SQUEEZE compresses the connectivity to 3.7T bits, which is competitive with the best progressive compression techniques reported so far. The geometry prediction encoding techniques introduced here lead to an additional 20% improvement in geometry compression over previous schemes. Our initial implementation on a 200 Mhz CPU achieves a decompression rate of about 15000 triangles per second. Finally, in general SQUEEZE downloads a model through 10 successive refinement stages, providing the full benefit of progressivity. After each refinement step, the user may manipulate the current resolution model as SQUEEZE decompresses the next upgrade, or temporarily stop the transmission until a higher level-of-detail is needed.
منابع مشابه
Multiresolution Random Accessible Mesh Compression
This paper presents a novel approach for mesh compression, which we call multiresolution random accessible mesh compression. In contrast to previous mesh compression techniques, the approach enables us to progressively decompress an arbitrary portion of a mesh without decoding other non-interesting parts. This simultaneous support of random accessibility and progressiveness is accomplished by a...
متن کاملMultiple multiresolution representation of functions and calculus for fast computation
We describe the mathematical representations, data structure and the implementation of the numerical calculus of functions in the software environment multiresolution analysis environment for scientific simulations, MADNESS. In MADNESS, each smooth function is represented using an adaptive pseudo-spectral expansion using the multiwavelet basis to a arbitrary but finite precision. This is an ext...
متن کاملRecent Advances in Multiresolution Analysis of 3D Meshes and their Applications
3D meshes are widely used in computer graphics applications for approximating 3D models. When representing complex shapes in raw data format, meshes consume a large amount of space. Applications calling for compact and fast processing of large 3D meshes have motivated a multitude of algorithms developped to process these datasets efficiently. The concept of multiresolution analysis proposes an ...
متن کاملShape optimisation with multiresolution subdivision surfaces and immersed finite elements
We develop a new optimisation technique that combines multiresolution subdivision surfaces for boundary description with immersed finite elements for the discretisation of the primal and adjoint problems of optimisation. Similar to wavelets multiresolution surfaces represent the domain boundary using a coarse control mesh and a sequence of detail vectors. Based on the multiresolution decomposit...
متن کاملInteractive Multiresolution Editing of Arbitrary Meshes
This paper presents a novel approach to multiresolution editing of a triangular mesh. The basic idea is to embed an editing area of a mesh onto a 2D rectangle and interpolate the user-specified editing information over the 2D rectangle. The result of the interpolation is mapped back to the editing area and then used to update the mesh. We adopt harmonic maps for the embedding and multilevel B-s...
متن کامل